Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROBLEME N REINES")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 9 of 9

  • Page / 1
Export

Selection :

  • and

THE MODULAR N-QUEEN PROBLEM IIKLOVE T.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 36; NO 1; PP. 33-48; BIBL. 4 REF.Article

A TECHNIQUE FOR IMPLEMENTING BACKTRACK ALGORITHMS AND ITS APPLICATIONHITOTUMATU H; NOSHITA K.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 174-175; BIBL. 5 REF.Article

A faster lexicographical N queens algorithmROHL, J. S.Information processing letters. 1983, Vol 17, Num 5, pp 231-233, issn 0020-0190Article

On the modular n-queen problemHEDEN, O.Discrete mathematics. 1992, Vol 102, Num 2, pp 155-161, issn 0012-365XArticle

A simplified solution of the N queen's problemREICHLING, M.Information processing letters. 1987, Vol 25, Num 4, pp 253-255, issn 0020-0190Article

An analytical evidence for Kalé's heuristic for the N queens problemSANG BONG OH.Information processing letters. 1993, Vol 46, Num 1, pp 51-54, issn 0020-0190Article

Chaotic neural networks with reinforced self-feedbacks and its application to N-Queen problemOHTA, Masaya.Mathematics and computers in simulation. 2002, Vol 59, Num 4, pp 305-317, issn 0378-4754, 13 p.Article

Linear congruence equations for the solutions of the N-queens problemERBAS, C; TANIK, M. M; ALIYAZICIOGLU, Z et al.Information processing letters. 1992, Vol 41, Num 6, pp 301-306, issn 0020-0190Article

A dynamic programming solution to the n-queens problemRIVIN, I; ZABIH, R.Information processing letters. 1992, Vol 41, Num 5, pp 253-256, issn 0020-0190Article

  • Page / 1